منابع مشابه
On Denotational Completeness
The founding idea of linear logic is the duality between A and A⊥, with values in ⊥. This idea is at work in the original denotational semantics of linear logic, coherent spaces, but also in the phase semantics of linear logic, where the bilinear form which induces the duality is nothing but the product in a monoid M, ⊥ being an arbitrary subset B of M. The rather crude phase semantics has the ...
متن کاملOn Denotational Completeness Extended Abstract
The founding idea of linear logic is the duality between A and A ? , with values in ?. This idea is at work in the original denotational semantics of linear logic, coherent spaces, but also in the phase semantics of linear logic, where the A bilinear form B which induces the duality is nothing but the product in a monoid M , ? being an arbitrary subset B of M. The rather crude phase semantics h...
متن کاملDenotational Completeness Revisited
We deene a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be characterised as those global elements of A satisfying all Kripke logical predicates on A.
متن کاملSoundness, Completeness and Non-redundancy of Operational Semantics for Verilog Based on Denotational Semantics
This paper investigates three significant questions of Verilog’s operational semantics: soundness, completeness and non-redundancy. Our understanding for these three questions is denotational-based. We provide an operational semantics for Verilog and prove that our operational semantics is sound, complete and non-redundant.
متن کاملOn the Approximation of Denotational Mu-Semantics
A signature gives rise to a language L (Var) by extending with variables x 2 Var and binding constructs x and x, corresponding to least and greatest xed points respectively. The natural denotational models for such languages are bicomplete dcpos as monotone-algebras. We prove that several approximating denotational semantics have the usual compositional semantics as their limit. These results p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00055-9